Extending PDDL to nondeterminism, limited sensing and iterative conditional plans

نویسندگان

  • Piergiorgio Bertoli
  • Alessandro Cimatti
  • Ugo Dal Lago
  • Marco Pistore
چکیده

The last decade has witnessed a dramatic progress in the variety and performance of techniques and tools for classical planning. The existence of a de-facto standard modeling language for classical planning, PDDL, has played a relevant role in this process. PDDL has fostered information sharing and data exchange in the planning community, and has made international classical planning competitions possible. At the same time, in the last few years, non-classical planning has gained considerable attention, due to its capability to capture relevant features of real-life domains which the classical framework fails to express. However, no significant effort has been made to achieve a standard mean for expressing nonclassical problems, making it difficult for the planning community to compare non-classical approaches and systems. This paper provides a contribution in this direction. We extend PDDL in order to express three very relevant features outside classical planning: uncertainty in the initial state, nondeterministic actions, and partial observability. NPDDL’s extensions are designed to retain backward compatibility with PDDL, and with an emphasis on compactness of the representation. Moreover, we define a powerful, user-friendly plan language to go together with NPDDL. The language allows expressing program-like plans with branching and iterations structures, as it is necessary to solve planning problems in the presence of initial state uncertainty, nondeterminism and partial observability. We are testing NPDDL’s ability to cope with a variety of problems, as they are handled by a state-ofthe-art planner, MBP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending Pddl to Nondeterminism , Limited Sensing and Iterative Conditional

This report has been submitted forr publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report forr early dissemination of its contents. In view of the transfert of copy right too the outside publisher, its distribution outside of ITC priorr to publication should be limited to peer communications and specificc requests. Afte...

متن کامل

In silico structural analysis of quorum sensing genes in Vibrio fischeri

Quorum sensing controls the luminescence of Vibrio fischeri through the transcriptional activator LuxR and the specific autoinducer signal produced by luxI. Amino acid sequences of these two genes were analyzed using bioinformatics tools. LuxI consists of 193 amino acids and appears to contain five α-helices and six ß-sheets when analyzed by SSpro8. LuxI belongs to the autoinducer synthetase fa...

متن کامل

Modeling E-Learning Activities in Automated Planning

This paper presents three approaches to generate learning designs using existing domain-independent planners. All of the approaches compile a course defined in a standard e-learning language into a planning domain, and a file containing student’s learning information into a planning problem. The learning designs are automatically generated from the plans that solve the problems. The approaches ...

متن کامل

Continual Planning in Golog

To solve ever more complex and longer tasks, mobile robots need to generate more elaborate plans and must handle dynamic environments and incomplete knowledge. We address this challenge by integrating two seemingly different approaches – PDDL-based planning for efficient plan generation and GOLOG for highly expressive behavior specification – in a coherent framework that supports continual plan...

متن کامل

PDDLAssistant: A tool for assisting construction and maintenance of attack graphs using PDDL

Attack graph is a well-known representation for computer security vulnerabilities, which captures how malicious activities can lead to a system compromise. A key weakness in the attack graph representation is that it scales poorly, particularly in large domains where the graph needs to enumerate both user and system interactions. One way to address this problem is to translate the attack graph ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003